package subArray;

/**
 * 四、子数组问题
 * 4. 乘积为正数的最大子数组长度
 * 2024-10-28
 */
public class demo22 {
    public int getMaxLen(int[] nums) {
        int n = nums.length;
        int[] f = new int[n+1];
        int[] g = new int[n+1];

        f[0] = g[0] = 1;

        for (int i = 1; i <= n; i++) {

        }
    }
}
